Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Eléments de l'association

Franche-Comté662
Pierre-Cyrille Heam28
Franche-Comté Sauf Pierre-Cyrille Heam" 634
Pierre-Cyrille Heam Sauf Franche-Comté" 0
Franche-Comté Et Pierre-Cyrille Heam 28
Franche-Comté Ou Pierre-Cyrille Heam 662
Corpus24195
\n\n\n\n \n

List of bibliographic references

Number of relevant bibliographic references: 28.
Ident.Authors (with country if any)Title
000397 Pierre-Cyrille Heam [France] ; Jean-Luc Joly [France]On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism
000F17 Alois Dreyfus [France] ; Pierre-Cyrille Heam [France] ; Olga Kouchnarenko [France] ; Catherine Masson [France]A Random Testing Approach Using Pushdown Automata
001097 Alois Dreyfus [France] ; Pierre-Cyrille Heam [France] ; Olga Kouchnarenko [France]Enhancing Approximations for Regular Reachability Analysis
001277 Alois Dreyfus [France] ; Pierre-Cyrille Heam [France] ; Olga Kouchnarenko [France]Random Grammar-based Testing for Covering All Non-Terminals
001959 Pierre-Cyrille Heam [France] ; Vincent Hugot [France] ; Olga Kouchnarenko [France]Loops and overloops for Tree Walking Automata
001A18 Pierre-Cyrille Heam [France] ; Vincent Hugot [France] ; Olga Kouchnarenko [France]On Positive TAGED with a Bounded Number of Constraints
001A53 Pierre-Cyrille Heam [France] ; Vincent Hugot [France] ; Olga Kouchnarenko [France]From Linear Temporal Logic Properties to Rewrite Propositions
002057 Pierre-Cyrille Heam [France] ; Vincent Hugot [France] ; Olga Kouchnarenko [France]From Linear Temporal Logic Properties to Rewrite Propositions
002230 Pierre-Cyrille Heam [France] ; Vincent Hugot [France] ; Olga Kouchnarenko [France]Loops and Overloops for Tree Walking Automata
002257 Pierre-Cyrille Heam [France] ; Catherine Masson [France]A Random Testing Approach Using Pushdown Automata
002508 Pierre-Cyrille Heam [France]On the Complexity of Computing the Profinite Closure of a Rational Language
002977 Pierre-Cyrille Heam [France] ; Vincent Hugot [France] ; Olga Kouchnarenko [France]Random Generation of Positive TAGEDs wrt. the Emptiness Problem
002C48 Adrian Caciula [France] ; Roméo Courbis [France] ; Violeta Felea [France] ; Pierre-Cyrille Heam [France] ; Rasvan Ionescu [France]Une approche parallèle et distribuée pour la complétion d'automates d'arbre
002C53 Roméo Courbis [France] ; Pierre-Cyrille Heam [France] ; Pierre Jourdan [France] ; Olga Kouchnarenko [France]Approximations par réécriture pour deux problèmes indécidables
002E78 Pierre-Cyrille Heam [France] ; Cyril Nicaud [France] ; Sylvain Schmitz [France]Parametric Random Generation of Deterministic Tree Automata
002F06 Pierre-Cyrille Heam [France] ; Olga Kouchnarenko [France] ; Jérôme Voinot [France]Component Simulation-based Substitutivity Managing QoS and Composition Issues
003329 Pierre-Cyrille Heam [France]Finite Automata for Software Realiability and Reachability Analyses
003382 Yohan Boichut [France] ; Pierre-Cyrille Heam [France] ; Olga Kouchnarenko [France]How to Tackle Integer Weighted Automata Positivity
003506 Roméo Courbis [France] ; Pierre-Cyrille Heam [France] ; Olga Kouchnarenko [France]TAGED Approximations for Temporal Properties Model-Checking
003C42 Pierre-Cyrille Heam [France] ; Cyril Nicaud [France]Seed: an easy to use random generator of recursive data structures for testing
003E66 Pierre-Cyrille Heam [France] ; Olga Kouchnarenko [France] ; Jérôme Voinot [France]Component Simulation-based Substitutivity Managing QoS Aspects
004200 Yohan Boichut [France] ; Pierre-Cyrille Heam [France]A Theoretical Limit for Safety Verification Techniques with Regular Fix-point Computations
004601 Yohan Boichut [France] ; Pierre-Cyrille Heam [France] ; Olga Kouchnarenko [France]Approximation based tree regular model checking
004614 Yohan Boichut [France] ; Pierre-Cyrille Heam [France]A Theoretical Limit for Safety Verification Techniques with Regular Fix-point Computations
004869 Pierre-Cyrille Heam [France] ; Olga Kouchnarenko [France] ; Jérôme Voinot [France]How to Handle QoS Aspects in Web Services Substitutivity Verification
004D59 Yohan Boichut [France] ; Pierre-Cyrille Heam [France] ; Olga Kouchnarenko [France]Vérifier automatiquement les protocoles de sécurité
004E14 Yohan Boichut [France] ; Pierre-Cyrille Heam [France] ; Olga Kouchnarenko [France]Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives
004E19 Pierre-Cyrille Heam [France] ; Olga Kouchnarenko [France] ; Jérôme Voinot [France]Towards Formalizing QoS of Web Services with Weighted Automata

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022